Earth Mover's Distance Approximate Earth Mover's Distance for the Efficient Content-based Image Retreival
نویسندگان
چکیده
منابع مشابه
Efficient Clustering Earth Mover's Distance
The two-class clustering problem is formulated as an integer convex optimisation problem which determines the maximum of the Earth Movers Distance (EMD) between two classes, constructing a bipartite graph with minimum flow and maximum inter-class EMD between two sets. Subsequently including the nearest neighbours of the start point in feature space and calculating the EMD for this labellings qu...
متن کاملApproximate earth mover's distance in linear time
Theorem 2 ([3]). f ∈ Lloc(R n), belongs to Cs(Rn) if and only if, in a wavelet decomposition of regularity r ≥ 1 > s there exist constants C0 and C1 such that, Approx. coeffs.: |fk| ≤ C0, k ∈ Z n and Detail coeffs.: |fλ| ≤ C12 −j(n/2+s), λ ∈ Λj, j ≥ 0 (1) Lemma 1. If 0 < s < 1 and (1) holds, then f ∈ Cs(Rn) with CH(f ) < C such that a12(ψ; s)C1 ≤ C ≤ a21(ψ; s)C0 + a22(ψ; s)C1 (2) For discrete d...
متن کاملThe Tangent Earth Mover's Distance
We present a new histogram distance, the Tangent Earth Mover’s Distance (TEMD). The TEMD is a generalization of the Earth Mover’s Distance (EMD) that is invariant to some global transformations. Thus, like the EMD it is robust to local deformations. Additionally, it is robuster to global transformations such as global translations and rotations of the whole image. The TEMD is formulated as a li...
متن کاملEarth Mover’s Distance Based Local Discriminant Basis
Local discriminant Basis (LDB) is a tool to extract useful features for signal and image classification problems. Original LDB methods rely on the timefrequency energy distribution of classes or empirical probability densities, with some information theoretic measure (such as Kullback-Leibler divergence) for feature selection. Depending on the problem, energy distributions may not provide the b...
متن کاملApproximate earth mover ’ s distance in linear time Sameer
The earth mover’s distance (EMD) [21] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(n3 log n)) computational complexity. We present a novel linear time algorithm for approximating the EMD for low dimensional histograms using the sum of absolute values of the weighted wavelet coefficients of the difference histogram. EMD computation is a spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartD
سال: 2011
ISSN: 1598-2866
DOI: 10.3745/kipstd.2011.18d.5.323